Extragradient thresholding methods for sparse solutions of co-coercive NCPs
نویسندگان
چکیده
منابع مشابه
ECME Thresholding Methods for Sparse Signal Reconstruction
We propose a probabilistic framework for interpreting and developing hard thresholding sparse signal reconstruction methods and present several new algorithms based on this framework. The measurements follow an underdetermined linear model, where the regression-coefficient vector is the sum of an unknown deterministic sparse signal component and a zero-mean white Gaussian component with an unkn...
متن کاملOn Accelerated Hard Thresholding Methods for Sparse Approximation
We propose and analyze acceleration schemes for hard thresholding methods with applications to sparse approximation in linear inverse systems. Our acceleration schemes fuse combinatorial, sparse projection algorithms with convex optimization algebra to provide computationally efficient and robust sparse recovery methods. We compare and contrast the (dis)advantages of the proposed schemes with t...
متن کاملIterative Thresholding for Sparse Approximations
Sparse signal expansions represent or approximate a signal using a small number of elements from a large collection of elementary waveforms. Finding the optimum sparse expansion is known to be NP hard in general and non-optimal strategies such as Matching Pursuit, Orthogonal Matching Pursuit, Basis Pursuit and Basis Pursuit De-noising are often called upon. These methods show good performance i...
متن کاملSome extragradient methods for common solutions of generalized equilibrium problems and fixed points of nonexpansive mappings
Correspondence: jwpeng6@yahoo. com.cn School of Mathematics, Chongqing Normal University, Chongqing 400047, PR China Abstract In this article, we introduce some new iterative schemes based on the extragradient method (and the hybrid method) for finding a common element of the set of solutions of a generalized equilibrium problem, and the set of fixed points of a family of infinitely nonexpansiv...
متن کاملGlobal bounds for the distance to solutions of co-coercive variational inequalities
We establish two global bounds measuring the distance from any vector to the solution set of the co-coercive variational inequality. To prove our results, we use the fact that the co-coercivity condition is sufficient for the (strong) monotonicity of (perturbed) fixed point and normal maps associated with variational inequalities.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2015
ISSN: 1029-242X
DOI: 10.1186/s13660-015-0551-5